Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method

نویسندگان

  • Éva Czabarka
  • Ondrej Sýkora
  • László A. Székely
  • Imrich Vrto
چکیده

The biplanar crossing number cr2(G) of a graph G is min{cr(G1)+ cr(G2)}, where cr is the planar crossing number and G1 ∪ G2 = G. We show that cr2(G) ≤ (3/8)cr(G). Using this result recursively, we bound the thickness by Θ(G) − 2 ≤ Kcr2(G) log2 n with some constant K. A partition realizing this bound for the thickness can be obtained by a polynomial time randomized algorithm. We show that for any size exceeding a certain threshold, there exists a graph G of this size, which simultaneously has the following properties: cr(G) is roughly as large as it can be for any graph of that size, and cr2(G) is as small as it can be for any graph of that size. The existence is shown using the probabilistic method. We dedicate this paper to our late colleague and friend, Ondrej Sýkora.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biplanar Crossing Numbers I: A Survey of Results and Problems

We survey known results and propose open problems on the biplanar crossing number. We study biplanar crossing numbers of speci c families of graphs, in particular, of complete bipartite graphs. We nd a few particular exact values and give general lower and upper bounds for the biplanar crossing number. We nd the exact biplanar crossing number of K5;q for every q.

متن کامل

On the Biplanar Crossing Number of Kn

The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the Euclidean plane. The k-planar crossing number crk(G) of G is min{cr(G1) + cr(G2) + . . .+ cr(Gk)}, where the minimum is taken over all possible decompositions of G into k subgraphs G1, G2, . . . , Gk. The problem of computing the crossing number of complete graphs, cr(Kn), exactly for sm...

متن کامل

k-planar Crossing Number of Random Graphs and Random Regular Graphs

We give an explicit extension of Spencer’s result on the biplanar crossing number of the ErdősRényi random graph G(n, p). In particular, we show that the k-planar crossing number of G(n, p) is almost surely Ω((np)). Along the same lines, we prove that for any fixed k, the k-planar crossing number of various models of random d-regular graphs is Ω((dn)) for d > c0 for some constant c0 = c0(k).

متن کامل

On the crossing numbers of Cartesian products with trees

Zip product was recently used in a note establishing the crossing number of the Cartesian product K1,n2Pm. In this paper, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding method bound for crossing numbers to weaken the connectivity condition under which the crossing number is additive for the zip product....

متن کامل

One- and two-page crossing numbers for some types of graphs

The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles on k half planes (pages). Such drawings are called k-page book drawings and the minimal number of edge crossings in such a drawing is called the k-page crossing number. In a one-page book drawing, all edges are placed on one side of the spine, and in a two-page bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2008